Monotonic singular functions of high smoothness.

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Entropy Estimate For High Dimensional Monotonic Functions

We establish upper and lower bounds for the metric entropy and bracketing entropy of the class of d-dimensional bounded monotonic functions under L norms. It is interesting to see that both the metric entropy and bracketing entropy have different behaviors for p < d/(d − 1) and p > d/(d − 1). We apply the new bounds for bracketing entropy to establish a global rate of convergence of the MLE of ...

متن کامل

Singular values of convex functions of matrices

‎Let $A_{i},B_{i},X_{i},i=1,dots,m,$ be $n$-by-$n$ matrices such that $‎sum_{i=1}^{m}leftvert A_{i}rightvert ^{2}$ and $‎sum_{i=1}^{m}leftvert B_{i}rightvert ^{2}$  are nonzero matrices and each $X_{i}$ is‎ ‎positive semidefinite‎. ‎It is shown that if $f$ is a nonnegative increasing ‎convex function on $left[ 0,infty right) $ satisfying $fleft( 0right)‎ ‎=0 $‎, ‎then  $$‎2s_{j}left( fleft( fra...

متن کامل

Smoothness of Multiple Refinable Functions

We consider the smoothness of solutions of a system of refinement equations written in the form φ = ∑ α∈Z a(α)φ(2 · − α), where the vector of functions φ = (φ1, . . . , φr) is in (Lp(R)) and a is a finitely supported sequence of r× r matrices called the refinement mask. We use the generalized Lipschitz space Lip∗(ν, Lp(R)), ν > 0, to measure smoothness of a given function. Our method is to rela...

متن کامل

Learning Monotonic Linear Functions

Learning probabilities (p-concepts [13]) and other real-valued concepts (regression) is an important role of machine learning. For example, a doctor may need to predict the probability of getting a disease P [y|x], which depends on a number of risk factors. Generalized additive models [9] are a well-studied nonparametric model in the statistics literature, usually with monotonic link functions....

متن کامل

The Capacity of Monotonic Functions

We consider the class M of monotonically increasing binary output functions. M has considerable practical signiicance in machine learning and pattern recognition because prior information often suggests a monotonic relationship between input and output variables. The decision boundaries of monotonic classiiers are compared and contrasted with those of linear classiiers. M is shown to have a VC ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Michigan Mathematical Journal

سال: 1968

ISSN: 0026-2285

DOI: 10.1307/mmj/1029000029